Solving the Rectangle Packing Problem by an Iterative Hybrid Heuristic
نویسندگان
چکیده
In this paper we propose an iterative hybrid heuristic approach consisting of two phases to solve the Rectangle Packing Problem. In the first phase, a strip width value W is fixed and the corresponding Strip Packing Problem is solved using an efficient hybrid GRASP-VNS heuristic. In the second one, a new value W is determined. The above phases are repeated until the stopping condition is met. Then, the results obtained by this iterated heuristic are compared with the results given by a Simulated Annealing given in the literature. The comparative analysis corroborates the effectiveness of the proposed hybrid approach.
منابع مشابه
A Novel Quasi-human Heuristic Algorithm for Two-dimensional Rectangle Packing Problem
Two-dimensional rectangle packing problem is the problem of packing a series of rectangles into a larger container with maximum area usage of the container. This problem involves many industrial applications, such as shipping, timber cutting, very large scale integration (VLSI) design, etc. It belongs to a subset of classical packing problems and has been shown to be NP hard. For solving this p...
متن کاملA new heuristic algorithm for rectangle packing
The rectangle packing problem often appears in encasement and cutting as well as very large-scale integration design. To solve this problem, many algorithms such as genetic algorithm, simulated annealing and other heuristic algorithms have been proposed. In this paper, a new heuristic algorithm is recommended based on two important concepts, namely, the corner-occupying action and caving degree...
متن کاملBottom-Left Placement Theorem for Rectangle Packing
This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectang...
متن کاملOn a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems
The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infin...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کامل